On forbidden subdivision characterizations of graph classes
نویسندگان
چکیده
منابع مشابه
On forbidden subdivision characterizations of graph classes
We provide a characterization of several graph parameters (the acyclic chromatic number, the arrangeability, and a sequence of parameters related to the expansion of a graph) in terms of forbidden subdivisions. Let us start with several definitions. Throughout the paper, we consider only simple undirected graphs. A graph G = sdt(G) is the t-subdivision of a graph G, if G is obtained from G by r...
متن کاملGraph classes characterized both by forbidden subgraphs and degree sequences
Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degree-sequence-forcing set if, for each graph G in the class C of F-free graphs, every realization of the degree sequence of G is also in C. We give a complete characterization of the degree-sequence-forcing sets F when F has cardinality at most two. © 2007 Wiley Period...
متن کاملOn the Maximum Number of Dominating Classes in Graph Coloring
In this paper we investigate the dominating- -color number، of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and H. This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].
متن کاملOn minimal forbidden subgraph characterizations of balanced graphs
A graph is balanced if its clique-matrix contains no edge-vertex incidence matrix of an odd chordless cycle as a submatrix. While a forbidden induced subgraph characterization of balanced graphs is known, there is no such characterization by minimal forbidden induced subgraphs. In this work, we provide minimal forbidden induced subgraph characterizations of balanced graphs restricted to graphs ...
متن کاملGraph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs
We study the complexity of the Graph Isomorphism problem on graph classes that are characterized by a finite number of forbidden induced subgraphs, focusing mostly on the case of two forbidden subgraphs. We show hardness results and develop techniques for the structural analysis of such graph classes, which applied to the case of two forbidden subgraphs give the following results: A dichotomy i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2008
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2007.05.008